Weighted 2-Motzkin Paths
نویسندگان
چکیده
This paper is motivated by two problems recently proposed by Coker on combinatorial identities related to the Narayana polynomials and the Catalan numbers. We find that a bijection of Chen, Deutsch and Elizalde can be used to provide combinatorial interpretations of the identities of Coker when it is applied to weighted plane trees. For the sake of presentation of our combinatorial correspondences, we provide a description of the bijection of Chen, Deutsch and Elizalde in a slightly different manner in the form of a direct construction from plane trees to 2-Motzkin paths without the intermediate step involving the Dyck paths. AMS Classification: 05A15, 05A19
منابع مشابه
Identities from Weighted 2-Motzkin Paths
Based on a weighted version of the bijection between Dyck paths and 2-Motzkin paths, we find combinatorial interpretations of two identities related to the Narayana polynomials and the Catalan numbers, in answer to two problems recently proposed by Coker. AMS Classification: 05A15, 05A19
متن کاملIdentities from Weighted Motzkin Paths
Based on a weighted version of the bijection between Dyck paths and 2-Motzkin paths, we find combinatorial interpretations of two identities related to the Narayana polynomials and the Catalan numbers. These interpretations answer two problems posed recently by Coker. AMS Classification: 05A15, 05A19
متن کاملMatrix identities on weighted partial Motzkin paths
We give a combinatorial interpretation of a matrix identity on Catalan numbers and the sequence (1, 4, 4, 4, . . .) which has been derived by Shapiro, Woan and Getu by using Riordan arrays. By giving a bijection between weighted partial Motzkin paths with an elevation line and weighted free Motzkin paths, we find a matrix identity on the number of weighted Motzkin paths and the sequence (1, k, ...
متن کامل# a 49 Integers 12 ( 2012 ) Inverses of Motzkin and Schröder Paths
The connection between weighted counts of Motzkin paths and moments of orthogonal polynomials is well known. We look at the inverse generating function of Motzkin paths with weighted horizontal steps, and relate it to Chebyshev polynomials of the second kind. The inverse can be used to express the number of paths ending at a certain height in terms of those ending at height 0. Paths of a more g...
متن کاملA note on 2-distant noncrossing partitions and weighted Motzkin paths
We prove a conjecture of Drake and Kim: the number of 2-distant noncrossing partitions of {1, 2, . . . , n} is equal to the sum of weights of Motzkin paths of length n, where the weight of a Motzkin path is a product of certain fractions involving Fibonacci numbers. We provide two proofs of their conjecture: one uses continued fractions and the other is combinatorial.
متن کاملGeneralizations of The Chung-Feller Theorem
The classical Chung-Feller theorem [2] tells us that the number of Dyck paths of length n with flaws m is the n-th Catalan number and independent on m. L. Shapiro [7] found the Chung-Feller properties for the Motzkin paths. In this paper, we find the connections between these two Chung-Feller theorems. We focus on the weighted versions of three classes of lattice paths and give the generalizati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004